Grid Resource Discovery using Tree Data Structure for Multi-Trait Requests

Grid is an extensive environment in which different resources are dispersed geographically. A user may need a resource or a combination of resources in order to solve a problem. The task to find such a resource is borne by resource discovery algorithms. Therefore, the resource discovery algorithms are of high importance in grids. The methods proposed to resource discovery so far have not suggested a method to discover several resources simultaneously in the form of a request. In this paper, we have proposed a method that is able to discover simultaneously the desired number of the resources for the user. In our proposed algorithm, the cost of the resource discovery is very low. By means of this method, a user will be able to request several resources simultaneously in one format. The results of simulations indicate that fewer numbers of nodes meet in the resource discovery stages in this method than that in the other suggested methods. Compared to other methods, this method also creates less traffic in the network.